This article addresses the ability of Parallel Distributed Processing (PDP) networks to generate stagewise cognitive development in accordance with Piaget's theory of cognitive epigenesis. We carried out a replication study of the simulation experiments by McClelland (1989) and McClelland and Jenkins (1991) in which a PDP network learns to solve balance scale problems. In objective tests motivated from catastrophe theory, a mathematical theory of transitions in epigenetical systems, no evidence for stage transitions in network performance was found. It is concluded (...) that PDP networks lack the ability to recover the positive outcomes of analogous catastrophe analyses of real cognitive developmental data. In an attempt to further characterize the learning behaviour of PDP networks, we carried out a second simulation study using the discrimination‐shift paradigm. The results thus obtained indicate that PDP learning is compatible with the learning of stimulus‐response relationships, not with the acquisition of mediating rules such as conceived in (neo‐)Piagetian theory. In closing, we speculate about the feasibility of simulating stagewise development with alternative network architectures. (shrink)

Changes in pupil size can reflect social interest or affect, and tend to get mimicked by observers during eye contact. Pupil mimicry has recently been observed in young infants, whereas it is unkno...

Strategic games require reasoning about other people’s and one’s own beliefs or intentions. Although they have clear commonalities with psychological tests of theory of mind, they are not clearly related to theory of mind tests for children between 9 and 10 years of age “Flobbe et al. J Logic Language Inform 17(4):417–442 (2008)”. We studied children’s (5–12 years of age) individual differences in how they played a strategic game by analyzing the strategies that they applied in a zero, first, and (...) second-order reasoning task. For the zero-order task, we found two subgroups with different accuracy levels. For the first-order task, subgroups of children applied different suboptimal strategies or an optimal strategy. For the second-order task only suboptimal strategies were present. Strategy use for all tasks was related to age. The 5- and 6-year old children were additionally tested on theory of mind understanding and executive functioning. Strategy-use in these children was related to working memory, but not to theory of mind after correction for age, verbal ability and general IQ. (shrink)

The paper is concerned with the psychological relevance of a logical model for deductive reasoning. We propose a new way to analyze logical reasoning in a deductive version of the Mastermind game implemented within a popular Dutch online educational learning system (Math Garden). Our main goal is to derive predictions about the difficulty of Deductive Mastermind tasks. By means of a logical analysis we derive the number of steps needed for solving these tasks (a proxy for working memory load). Our (...) model is based on the analytic tableaux method, known from proof theory. We associate the difficulty of Deductive Mastermind game-items with the size of the corresponding logical trees obtained by the tableaux method. We derive empirical hypotheses from this model. A large group of students (over 37 thousand children, 5–12 years of age) played the Deductive Mastermind game, which gave empirical difficulty ratings of all 321 game-items. The results show that our logical approach predicts these item ratings well, which supports the psychological relevance of our model. (shrink)

This article addresses the ability of Parallel Distributed Processing (PDP) networks to generate stagewise cognitive development in accordance with Piaget's theory of cognitive epigenesis. We carried out a replication study of the simulation experiments by McClelland (1989) and McClelland and Jenkins (1991) in which a PDP network learns to solve balance scale problems. In objective tests motivated from catastrophe theory, a mathematical theory of transitions in epigenetical systems, no evidence for stage transitions in network performance was found. It is concluded (...) that PDP networks lack the ability to recover the positive outcomes of analogous catastrophe analyses of real cognitive developmental data. In an attempt to further characterize the learning behaviour of PDP networks, we carried out a second simulation study using the discrimination‐shift paradigm. The results thus obtained indicate that PDP learning is compatible with the learning of stimulus‐response relationships, not with the acquisition of mediating rules such as conceived in (neo‐)Piagetian theory. In closing, we speculate about the feasibility of simulating stagewise development with alternative network architectures. (shrink)

Strategic games require reasoning about other people’s and one’s own beliefs or intentions. Although they have clear commonalities with psychological tests of theory of mind, they are not clearly related to theory of mind tests for children between 9 and 10 years of age “Flobbe et al. J Logic Language Inform 17(4):417–442 (2008)”. We studied children’s (5–12 years of age) individual differences in how they played a strategic game by analyzing the strategies that they applied in a zero, first, and (...) second-order reasoning task. For the zero-order task, we found two subgroups with different accuracy levels. For the first-order task, subgroups of children applied different suboptimal strategies or an optimal strategy. For the second-order task only suboptimal strategies were present. Strategy use for all tasks was related to age. The 5- and 6-year old children were additionally tested on theory of mind understanding and executive functioning. Strategy-use in these children was related to working memory, but not to theory of mind after correction for age, verbal ability and general IQ. (shrink)

This article addresses the ability of Parallel Distributed Processing (PDP) networks to generate stagewise cognitive development in accordance with Piaget's theory of cognitive epigenesis. We carried out a replication study of the simulation experiments by McClelland (1989) and McClelland and Jenkins (1991) in which a PDP network learns to solve balance scale problems. In objective tests motivated from catastrophe theory, a mathematical theory of transitions in epigenetical systems, no evidence for stage transitions in network performance was found. It is concluded (...) that PDP networks lack the ability to recover the positive outcomes of analogous catastrophe analyses of real cognitive developmental data. In an attempt to further characterize the learning behaviour of PDP networks, we carried out a second simulation study using the discrimination‐shift paradigm. The results thus obtained indicate that PDP learning is compatible with the learning of stimulus‐response relationships, not with the acquisition of mediating rules such as conceived in (neo‐)Piagetian theory. In closing, we speculate about the feasibility of simulating stagewise development with alternative network architectures. (shrink)

For various domains in proportional reasoning cognitive development is characterized as a progression through a series of increasingly complex rules. A multiplicative relationship between two task features, such as weight and distance information of blocks placed at both sides of the fulcrum of a balance scale, appears difficult to discover. During development, children change their beliefs about the balance scale several times: from a focus on the weight dimension (Rule I) to occasionally considering the distance dimension (Rule II), guessing (Rule (...) III), and applying multiplication (Rule IV; Siegler, 1981). Because of the detailed empirical findings the balance scale task has become a benchmark task for computational models of proportional reasoning. In this article, we present a large empirical study (N = 420) of which the findings provide a challenge for computational models. The effect of feedback and the effect of individually adapted training items on rule transition were tested for children using Rule I or Rule II. Presenting adapted training items initiates belief revision for Rule I but not for Rule II. The experience of making mistakes (by providing feedback) induces a change for both Rule I and Rule II. However, a delayed posttest shows that these changes are preserved after 2 weeks only for children using Rule I. We conclude that the transition from Rule I to Rule II differs from the transition from Rule II to a more complex rule. Concerning these empirical findings, we will review performance of computational models and the implications for a future belief revision model. It is one Thing, to show a Man that he is in an Error, and another, to put him in possession of Truth. John Locke. (shrink)

Bifurcation analysis of a real-time implementation of an ART network, which is functionally similar to the generalized localist model discussed in Page's manifesto shows that it yields a phase transition from local to distributed representation owing to continuous variation of the range of inhibitory connections. Hence there appears to be a qualitative dichotomy between local and distributed representations at the level of connectionistic networks conceived of as instances of nonlinear dynamical systems.

A distinction should be made between the formation of stimulus-driven associations and cognitive concepts. To test the learning mode of a neural network, we propose a simple and classic input-output test: the discrimination shift task. Feed-forward PDP models appear to form stimulus-driven associations. A Hopfield network should be extended to apply the test.